Did Euclid Need the Euclidean Algorithm to Prove Unique Factorization?
نویسندگان
چکیده
منابع مشابه
Did Euclid Need the Euclidean Algorithm to Prove Unique Factorization?
Euclid’s lemma can be derived from the algebraic gcd property, but it is not at all apparent that Euclid himself does this. We would be quite surprised if he didn’t use this property because he points it out early on and because we expect him to make use of the Euclidean algorithm in some significant way. In this paper, we explore the question of just how the algebraic gcd property enters into ...
متن کاملWhy Did Lagrange "Prove" the Parallel Postulate?
1. INTRODUCTION. We begin with an often-told story from the Budget of Paradoxes by Augustus de Morgan: " Lagrange, in one of the later years of his life, imagined " that he had solved the problem of proving Euclid's parallel postulate. " He went so far as to write a paper, which he took with him to the [Institut de France], and began to read it. " But, De Morgan continues, " something struck hi...
متن کاملThe Mixed Binary Euclid Algorithm
We present a new GCD algorithm for two integers that combines both the Euclidean and the binary gcd approaches. We give its worst case time analysis and prove that its bit-time complexity is still O(n) for two n-bit integers. However, our preliminar experiments show that it is very fast for small integers. A parallel version of this algorithm matches the best presently known time complexity, na...
متن کاملEuclid Meets Bézout: Intersecting Algebraic Plane Curves with the Euclidean Algorithm
We can be quite sure that Euclid (∼325 to ∼265 BC) and Étienne Bézout (1730–83) never met. But we show here how Euclid’s algorithm for polynomials can be used to find, with their multiplicities, the points of intersection of two algebraic plane curves. As a consequence, we obtain a simple proof of Bézout’s Theorem, giving the total number of such intersections. We’d perhaps expect two such plan...
متن کاملEuclid ’ s Algorithm Andrzej
The main goal of the paper is to prove the correctness of the Euclid’s algorithm for SCM. We define the Euclid’s algorithm and describe the natural semantics of it. Eventually we prove that the Euclid’s algorithm computes the Euclid’s function. Let us observe that the Euclid’s function is defined as a function mapping finite partial states to finite partial states of SCM rather than pairs of in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The American Mathematical Monthly
سال: 2006
ISSN: 0002-9890,1930-0972
DOI: 10.1080/00029890.2006.11920298